Cut elimination for a calculus with context-dependent rules
نویسنده
چکیده
Context dependent rules are an obstacle to cut elimination. A generalised sequent style formulation using deep inferences is helpful and may indeed be essential. First this is shown for a substructural, multiplicative, pure propositional calculus. Then we consider the extra problems induced by non-logical axioms and extend the results to additive connectives and quantifiers.
منابع مشابه
Towards an algorithmic construction of cut-elimination procedures
We investigate cut-elimination in propositional substructural logics. The problem is to decide whether a given calculus admits (reductive) cut-elimination. We show that, for commutative single-conclusion sequent calculi containing generalized knotted structural rules and arbitrary logical rules, the problem can be decided by resolution-based methods. A general cut-elimination proof for these ca...
متن کاملProof Transformation by CERES
Cut-elimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cut-elimination method CERES (cut-elimination by resolution) works by constructing a set of clauses from a proof with cuts. Any resolution refutation of this set then serves as a skeleton ...
متن کاملGeneralised elimination rules and harmony
Standard natural deduction rules for Int (intuitionistic predicate logic) in the style of Gentzen and Prawitz are presumed to be familiar. The theory of cut-elimination for sequent calculus rules is very clear; whether a derivation in a sequent calculus is cut-free or not is easily defined, according to the presence or absence of instances of the Cut rule. Normality of a (natural) deduction is ...
متن کاملRule-Irredundancy and the Sequent Calculus for Core Logic
We explore the consequences, for logical system-building, of taking seriously (i) the aim of having irredundant rules of inference, and (ii) a preference for proofs of stronger results over proofs of weaker ones. This leads one to re-consider the structural rules of Reflexivity, Thinning and Cut. Reflexivity survives in the minimally necessary form φ : φ. Proofs have to get started. Cut is subj...
متن کاملComplexity Analysis of Cut Elimination in First Order Based Logics
The worst-case complexity of cut elimination in sequent calculi for first order based logics is investigated in terms of the increase in logical depth of the deduction. It is shown that given a calculus satisfying a general collection of sufficient conditions for cut elimination and given a deduction with cuts, there exists a cut free deduction with a logical depth, in the worst case, hyper-exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Arch. Math. Log.
دوره 40 شماره
صفحات -
تاریخ انتشار 2001